Efficient Algorithms for Allocation Policies
نویسندگان
چکیده
Recent work [2] proposed extending the OLAP data model to represent data ambiguity. Specifically, one form of ambiguity that work addressed arose from relaxing the assumption that all dimension attributes in a fact are assigned leaf-level values from the underlying domain hierarchy. Such data was referred to as imprecise. Allocation was proposed by [2] as a mechanism to deal with imprecision. Intuitively, an allocation policy assigns a weighted portion of an imprecise record to each cell in the region covered by the imprecise record. [2] motivated allocation policies as a mathematically principled method for handling imprecision, and detailed the properties of several allocation policies. The result of applying an allocation policy to an imprecise database D is referred to as an extended data model.
منابع مشابه
Cycle Time Reduction and Runtime Rebalancing by Reallocating Dependent Tasks
Business Process Management Systems (BPMS) is a complex information system that provides designing, administrating, and improving the business processes. Task allocation to human resources is one of the most important issues which should be managed more efficiently in BPMS. Task allocation algorithms are defined in order to meet the various policies of organizations. The most important of these...
متن کاملارزیابی سیاستهای زمانبندی در نسل چهارم شبکههای سلولی (LTE)
New generation of wireless networks, LTE and WiMAX, supports many services which consume a lot of resources (such as VOIP, Video Conference, Digital Video, Multimedia streams and online Multi-player Games). Supporting multi-media services in wireless communication systems provide new resource allocation challenges. Because of high loads in downlink, efficient resource allocation is vital in dow...
متن کاملStatic Task Allocation in Distributed Systems Using Parallel Genetic Algorithm
Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...
متن کاملSimulation and Optimisation for Management of Intermodal Terminals
This paper presents a decision support system for improving the management of intermodal container terminals. It is implemented as a modular architecture which integrates a forecasting model, a planner and a simulation module. While the forecasting module estimates container traffic, the planning module uses this information to generate efficient policies for storage, resource allocation and sc...
متن کاملA Clustering Based Location-allocation Problem Considering Transportation Costs and Statistical Properties (RESEARCH NOTE)
Cluster analysis is a useful technique in multivariate statistical analysis. Different types of hierarchical cluster analysis and K-means have been used for data analysis in previous studies. However, the K-means algorithm can be improved using some metaheuristics algorithms. In this study, we propose simulated annealing based algorithm for K-means in the clustering analysis which we refer it a...
متن کامل